split graph 예문

• Because chordal graphs are perfect, so are the split graphs.
• Split graphs have cochromatic number 2.
• Finding a Hamiltonian cycle remains NP-complete even for split graphs which are strongly chordal graphs.
• It is also well known that the Minimum Dominating Set problem remains NP-complete for split graphs.
• The double split graphs are a relative of the split graphs that can also be shown to be perfect.
• The double split graphs are a relative of the split graphs that can also be shown to be perfect.
• She is also known for co-inventing split graphs and for her contributions to line graphs of hypergraphs.
• The graphs with cochromatic number 2 are exactly the bipartite graphs, complements of bipartite graphs, and split graphs.
• Some other optimization problems that are NP-complete on more general graph families, including graph coloring, are similarly straightforward on split graphs.
• If a graph is both a split graph and an interval graph, then its complement is both a split graph and a comparability graph, and vice versa.
• If a graph is both a split graph and an interval graph, then its complement is both a split graph and a comparability graph, and vice versa.
• Split graphs are graphs that are both chordal and the complements of chordal graphs . showed that, in the limit as n goes to infinity, the fraction of n-vertex chordal graphs that are split approaches one.
• Split graphs can be characterized in terms of their forbidden induced subgraphs : a graph is split if and only if no induced subgraph is a cycle on four or five vertices, or a pair of disjoint edges ( the complement of a 4-cycle ).
• The "'double split graphs "', a family of graphs derived from split graphs by doubling every vertex ( so the clique comes to induce an antimatching and the independent set comes to induce a matching ), figure prominently as one of five basic classes of perfect graphs from which all others can be formed in the proof by of the Strong Perfect Graph Theorem.
• The "'double split graphs "', a family of graphs derived from split graphs by doubling every vertex ( so the clique comes to induce an antimatching and the independent set comes to induce a matching ), figure prominently as one of five basic classes of perfect graphs from which all others can be formed in the proof by of the Strong Perfect Graph Theorem.
• It may also be computed in polynomial time for graphs of bounded treewidth including series-parallel graphs, outerplanar graphs, and Halin graphs, as well as for split graphs, for the complements of chordal graphs, for permutation graphs, for the comparability graphs of interval orders, and of course for interval graphs themselves, since in that case the pathwidth is just one less than the maximum number of intervals covering any point in an interval representation of the graph.